A monotone isomorphism theorem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A First-Order Isomorphism Theorem

We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds. Since \natural" complete problems seem to stay complete via fops, this indicates that up to rst-order isomorphism there is only one \natural" complete problem for each \...

متن کامل

A Theorem on the Isomorphism Property

An L{structure is called internally presented in a nonstandard universe if its base set and interpretation of every symbol in L are internal. A nonstandard universe is said to satisfy the {isomorphism property if for any two internally presented L{structures A and B, where L has less than many symbols, A is elementarily equivalent to B implies that A is isomorphic to B. In this paper we prove t...

متن کامل

A Dolbeault Isomorphism Theorem in Infinite Dimensions

For a large class of separable Banach spaces, we prove the real analytic Dolbeault isomorphism theorem for open subsets.

متن کامل

A 2-Isomorphism Theorem for Hypergraphs

One can associate a polymatroid with a hypergraph that naturally generalises the cycle matroid of a graph. Whitney's 2-isomorphism theorem characterises when two graphs have isomorphic cycle matroids. In this paper Whitney's theorem is generalised to hypergraphs and polymatroids by characterising when two hyper-graphs have isomorphic associated polymatroids. 1997 Academic Press

متن کامل

An isomorphism theorem for digraphs

A seminal result by Lovász states that two digraphs A and B (possibly with loops) are isomorphic if and only if for every digraph X the number of homomorphisms X → A equals the number of homomorphisms X → B. Lovász used this result to deduce certain cancellation properties for the direct product of digraphs. We develop an analogous result for the class of digraphs without loops, and with weak h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Probability Theory and Related Fields

سال: 2016

ISSN: 0178-8051,1432-2064

DOI: 10.1007/s00440-016-0700-x